On the correlation distribution of Delsarte-Goethals sequences

نویسنده

  • Kai-Uwe Schmidt
چکیده

For odd integer m ≥ 3 and t = 0, 1, . . . , m−1 2 , we define Family V (t) to be a set of size 2 containing binary sequences of period 2 − 2. The nontrivial correlations between sequences in Family V (t) are bounded in magnitude by 2+2. Families V (0) and V (1) compare favourably to the small and large Kasami sets, respectively. So far, the correlation distribution of Family V (t) is only known for t = 0. A general framework for computing the correlation distribution of Family V (t) is established. The correlation distribution of V (1) is derived, and a way to obtain the correlation distribution of V (2) is described.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reed Muller Sensing Matrices and the LASSO

We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This method of construction results in sensing matrices with low coherence and spectral norm. The first family, which we call Delsarte-Goethals frames, are 2 dimensional tight frames with redundancy 2. The second family, which ...

متن کامل

On the Trellis Representation of the Delsarte-Goethals Codes

In this correspondence, the trellis representation of the Kerdock and Delsarte–Goethals codes is addressed. It is shown that the states of a trellis representation of DG(m; ) under any bit-order are either strict-sense nonmerging or strict-sense nonexpanding, except, maybe, at indices within the code’s distance set. For 3 and for m 6, the state complexity, smax[DG(m; )], is found. For all value...

متن کامل

Three-weight Codes and Association Schemes

Three-weight projective codes C are considered for which the restrietion to C of the Hamming association scheme Hn(q) is an association scheme with three classes. Sufficient conditions are established and restrictions on the three weights of C are obtained. It is shown in the binary case that the three-weight subcodes of the shortened second-order Reed-Muller codes provide a large class of exam...

متن کامل

A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller code

We give a new proof of Delsarte, Goethals and Mac williams theorem on minimal weight codewords of generalized Reed-Muller codes published in 1970. To prove this theorem, we consider intersection of support of minimal weight codewords with affine hyperplanes and we proceed by recursion.

متن کامل

A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller codes

We give a new proof of Delsarte, Goethals and Mac williams theorem on minimal weight codewords of generalized Reed-Muller codes published in 1970. To prove this theorem, we consider intersection of support of minimal weight codewords with affine hyperplanes and we proceed by recursion.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 59  شماره 

صفحات  -

تاریخ انتشار 2011